TSTP Solution File: SEV290^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV290^5 : TPTP v6.1.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n104.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:34:00 EDT 2014
% Result : Theorem 0.42s
% Output : Proof 0.42s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV290^5 : TPTP v6.1.0. Bugfixed v5.2.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n104.star.cs.uiowa.edu
% % Model : x86_64 x86_64
% % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory : 32286.75MB
% % OS : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 08:44:46 CDT 2014
% % CPUTime : 0.42
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0xae7ab8>, <kernel.DependentProduct object at 0xec2a70>) of role type named c0_type
% Using role type
% Declaring c0:((fofType->Prop)->Prop)
% FOF formula (<kernel.Constant object at 0xf18128>, <kernel.DependentProduct object at 0xec2710>) of role type named cSUCC_type
% Using role type
% Declaring cSUCC:(((fofType->Prop)->Prop)->((fofType->Prop)->Prop))
% FOF formula (<kernel.Constant object at 0xf1fd40>, <kernel.DependentProduct object at 0xec2a70>) of role type named c_less__eq__type
% Using role type
% Declaring c_less__eq_:(((fofType->Prop)->Prop)->(((fofType->Prop)->Prop)->Prop))
% FOF formula (((eq (((fofType->Prop)->Prop)->((fofType->Prop)->Prop))) cSUCC) (fun (Xn:((fofType->Prop)->Prop)) (Xp:(fofType->Prop))=> ((ex fofType) (fun (Xx:fofType)=> ((and (Xp Xx)) (Xn (fun (Xt:fofType)=> ((and (not (((eq fofType) Xt) Xx))) (Xp Xt))))))))) of role definition named cSUCC_def
% A new definition: (((eq (((fofType->Prop)->Prop)->((fofType->Prop)->Prop))) cSUCC) (fun (Xn:((fofType->Prop)->Prop)) (Xp:(fofType->Prop))=> ((ex fofType) (fun (Xx:fofType)=> ((and (Xp Xx)) (Xn (fun (Xt:fofType)=> ((and (not (((eq fofType) Xt) Xx))) (Xp Xt)))))))))
% Defined: cSUCC:=(fun (Xn:((fofType->Prop)->Prop)) (Xp:(fofType->Prop))=> ((ex fofType) (fun (Xx:fofType)=> ((and (Xp Xx)) (Xn (fun (Xt:fofType)=> ((and (not (((eq fofType) Xt) Xx))) (Xp Xt))))))))
% FOF formula (((eq (((fofType->Prop)->Prop)->(((fofType->Prop)->Prop)->Prop))) c_less__eq_) (fun (Xx:((fofType->Prop)->Prop)) (Xy:((fofType->Prop)->Prop))=> (forall (Xp:(((fofType->Prop)->Prop)->Prop)), (((and (Xp Xx)) (forall (Xz:((fofType->Prop)->Prop)), ((Xp Xz)->(Xp (cSUCC Xz)))))->(Xp Xy))))) of role definition named c_less__eq__def
% A new definition: (((eq (((fofType->Prop)->Prop)->(((fofType->Prop)->Prop)->Prop))) c_less__eq_) (fun (Xx:((fofType->Prop)->Prop)) (Xy:((fofType->Prop)->Prop))=> (forall (Xp:(((fofType->Prop)->Prop)->Prop)), (((and (Xp Xx)) (forall (Xz:((fofType->Prop)->Prop)), ((Xp Xz)->(Xp (cSUCC Xz)))))->(Xp Xy)))))
% Defined: c_less__eq_:=(fun (Xx:((fofType->Prop)->Prop)) (Xy:((fofType->Prop)->Prop))=> (forall (Xp:(((fofType->Prop)->Prop)->Prop)), (((and (Xp Xx)) (forall (Xz:((fofType->Prop)->Prop)), ((Xp Xz)->(Xp (cSUCC Xz)))))->(Xp Xy))))
% FOF formula ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))) of role conjecture named cBLEDSOE1
% Conjecture to prove = ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))']
% Parameter fofType:Type.
% Parameter c0:((fofType->Prop)->Prop).
% Definition cSUCC:=(fun (Xn:((fofType->Prop)->Prop)) (Xp:(fofType->Prop))=> ((ex fofType) (fun (Xx:fofType)=> ((and (Xp Xx)) (Xn (fun (Xt:fofType)=> ((and (not (((eq fofType) Xt) Xx))) (Xp Xt)))))))):(((fofType->Prop)->Prop)->((fofType->Prop)->Prop)).
% Definition c_less__eq_:=(fun (Xx:((fofType->Prop)->Prop)) (Xy:((fofType->Prop)->Prop))=> (forall (Xp:(((fofType->Prop)->Prop)->Prop)), (((and (Xp Xx)) (forall (Xz:((fofType->Prop)->Prop)), ((Xp Xz)->(Xp (cSUCC Xz)))))->(Xp Xy)))):(((fofType->Prop)->Prop)->(((fofType->Prop)->Prop)->Prop)).
% Trying to prove ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))
% Found x0:(x Xx)
% Found x0 as proof of ((c_less__eq_ Xx) c0)
% Found (fun (x0:(x Xx))=> x0) as proof of ((c_less__eq_ Xx) c0)
% Found (fun (Xx:((fofType->Prop)->Prop)) (x0:(x Xx))=> x0) as proof of ((x Xx)->((c_less__eq_ Xx) c0))
% Found (fun (Xx:((fofType->Prop)->Prop)) (x0:(x Xx))=> x0) as proof of (forall (Xx:((fofType->Prop)->Prop)), ((x Xx)->((c_less__eq_ Xx) c0)))
% Found (ex_intro000 (fun (Xx:((fofType->Prop)->Prop)) (x0:(x Xx))=> x0)) as proof of ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))
% Found ((ex_intro00 (fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0))) (fun (Xx:((fofType->Prop)->Prop)) (x0:((fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0)) Xx))=> x0)) as proof of ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))
% Found (((ex_intro0 (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))) (fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0))) (fun (Xx:((fofType->Prop)->Prop)) (x0:((fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0)) Xx))=> x0)) as proof of ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))
% Found ((((ex_intro (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))) (fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0))) (fun (Xx:((fofType->Prop)->Prop)) (x0:((fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0)) Xx))=> x0)) as proof of ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))
% Found ((((ex_intro (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))) (fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0))) (fun (Xx:((fofType->Prop)->Prop)) (x0:((fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0)) Xx))=> x0)) as proof of ((ex (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0)))))
% Got proof ((((ex_intro (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))) (fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0))) (fun (Xx:((fofType->Prop)->Prop)) (x0:((fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0)) Xx))=> x0))
% Time elapsed = 0.100160s
% node=8 cost=232.000000 depth=8
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% ((((ex_intro (((fofType->Prop)->Prop)->Prop)) (fun (A:(((fofType->Prop)->Prop)->Prop))=> (forall (Xx:((fofType->Prop)->Prop)), ((A Xx)->((c_less__eq_ Xx) c0))))) (fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0))) (fun (Xx:((fofType->Prop)->Prop)) (x0:((fun (a0:((fofType->Prop)->Prop))=> ((c_less__eq_ a0) c0)) Xx))=> x0))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------